#include<stdio.h>
#include<assert.h>
void Swap(int *a ,int *b)                       
{                                               
    int c = *a;
    *a = *b;
    *b =  c;                     
}
int BinarySearch(int *a,int n,int x)
{
  assert(a);

  int begin = 0;
  int end = n-1;
  //
  while(begin <= end )
  {
    int mid = begin + ((end-begin)>>1);
    if(a[mid]<x)
      begin = mid+1;
    else if(a[mid]>x)
      end = mid-1;
    else 
      return mid;
  }
  return -1;
}
long long Fac(size_t N)
{
  if(N==0)
    return 1;

  return Fac(N-1)*N;
}
long long Fib(size_t N)
{
  if(N<3)
    return 1;

  return Fib(N-1) + Fib(N-2);
}
void Bubblesort(int *a,int n)
{
    assert(a);
    for(size_t end = n; end > 0; --end)
    {
      int exchange = 0;
      for(size_t i = 1; i < end; ++i)
      {
        if(a[i-1] > a[i])
        {
           Swap(&a[i-1],&a[i]);
           exchange = 1;
        }
      }
      if(exchange == 0)
        break;
    }
}

int main()
{
 /* int cnt = 0;
  int cmt = 0;
  for(int i=0;i<10;++i)
  {
      cmt++;
    for(int j=0;j<10;++j)
    {
      cnt++;
    }
  }
  int N=0;
  scanf("%d",&N);
  for(int i=0;i<N*2;++i)
  {
    ++cnt;
  }
  for(int i=0;i<N;++i)
  {
    for(int j=0;j<N;++j)
    {
      ++cnt;
    }
  }*/

  return 0;
}
